A two machine bicriteria scheduling problem
نویسندگان
چکیده
In this paper we consider the bicriteria problem of scheduling n jobs on two parallel machines to minimize the primary criterion of maximum tardiness (1 .!9 ) and the secondary criterion of number of tardy jobs (NT). Algorithms are developed to optimize each of these criteria. Some properties on which the 1 .!9 algorithm is based are developed. Computational experience with the algorithms is also reported. ( 2000 Elsevier Science B.V. All rights reserved.
منابع مشابه
On the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines
We consider the ordinary NP-hard two-machine flow shop problem with the objective of determining simultaneously a minimal common due date and the minimal number of tardy jobs. In [S. S. Panwalkar, C. Koulamas, An O(n) algorithm for the variable common due date, minimal tardy jobs bicriteria two-machine flow shop problem with ordered machines, European Journal of Operational Research 221 (2012),...
متن کاملBicriteria models to minimize the total weighted number of tardy jobs with convex controllable processing times and common due date assignment
We study a single-machine scheduling problem in a flexible framework where both job processing times and due dates are decision variables to be determined by the scheduler. The model can also be applied for quoting delivery times when some parts of the jobs may be outsourced. We analyze the problem with common due date assignment and a convex resource consumption function. We provide a bicriter...
متن کاملA fuzzy mixed-integer goal programming model for a parallel machine scheduling problem with sequence-dependent setup times and release dates
This paper presents a new mixed-integer goal programming (MIGP) model for a parallel machine scheduling problem with sequence-dependent setup times and release dates. Two objectives are considered in the model to minimize the total weighted flow time and the total weighted tardiness simultaneously. Due to the com-plexity of the above model and uncertainty involved in real-world scheduling probl...
متن کاملSingle Machine Scheduling with Controllable Processing Times by submodular Optimization
In scheduling with controllable processing times the actual processing time of each job is to be chosen from the interval between the smallest (compressed or fully crashed) value and the largest (decompressed or uncrashed) value. In the problems under consideration, the jobs are processed on a single machine and the quality of a schedule is measured by two functions: the maximum cost (that depe...
متن کاملTwo-machine flowshop scheduling with flexible operations and controllable processing times
TWO-MACHINE FLOWSHOP SCHEDULING WITH FLEXIBLE OPERATIONS AND CONTROLLABLE PROCESSING TIMES Zeynep Uruk M.S. in Industrial Engineering Advisor: Prof. Dr. Selim Aktürk Co-Advisor: Asst. Prof. Dr. Hakan Gültekin August, 2011 In this study, we consider a two-machine flowshop scheduling problem with identical jobs. Each of these jobs has three operations, where the first operation must be performed ...
متن کامل